PoInTree: A Polar and Interactive Phylogenetic Tree
نویسندگان
چکیده
منابع مشابه
PoInTree: A Polar and Interactive Phylogenetic Tree
PoInTree (Polar and Interactive Tree) is an application that allows to build, visualize and customize phylogenetic trees in a polar interactive and highly flexible view. It takes as input a FASTA file or multiple alignment formats. Phylogenetic tree calculation is based on a sequence distance method and utilizes the Neighbor Joining (NJ) algorithm. It also allows displaying precalculated trees ...
متن کاملPTC: An Interactive Tool for Phylogenetic Tree Construction
A phylogenetic tree represents the evolutionary history of a group of organisms. In this work, we introduce a novel interactive tool for constructing phylogenetic trees, Phylogenetic Tree Construction package. The package supports four well-known algorithms, Unweighted Pair Group Method using Arithmetic average, Neighbor Joining, Fitch Margoliash, and Maximum Parsimony.
متن کاملInteractive Tree Of Life (iTOL): an online tool for phylogenetic tree display and annotation
UNLABELLED Interactive Tree Of Life (iTOL) is a web-based tool for the display, manipulation and annotation of phylogenetic trees. Trees can be interactively pruned and re-rooted. Various types of data such as genome sizes or protein domain repertoires can be mapped onto the tree. Export to several bitmap and vector graphics formats is supported. AVAILABILITY iTOL is available at http://itol....
متن کاملBuilding a phylogenetic tree 134567
Several artificial organisms are shown on the cards. These drawings have been prepared so that it is easy to find differences and to distinguish between the characteristics of each organism. No numerical data are needed to distinguish between characteristics such as long and short birds’ tails. In contrast, with real organisms a researcher must usually collect numerical data and subjectively de...
متن کاملA matroid associated with a phylogenetic tree
A (pseudo-)metric D on a finite set X is said to be a ‘tree metric’ if there is a finite tree with leaf set X and nonnegative edge weights so that, for all x, y ∈ X , D(x, y) is the path distance in the tree between x and y. It is well known that not every metric is a tree metric. However, when some such tree exists, one can always find one whose interior edges have strictly positive edge weigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Genomics, Proteomics & Bioinformatics
سال: 2005
ISSN: 1672-0229
DOI: 10.1016/s1672-0229(05)03009-3